Using Automated Approximate Satisfaction in Parameter Search for Dynamic Agent Models

نویسنده

  • Jan Treur
چکیده

Numerical agent models often include a number of parameters. The values of such parameters are usually determined by using some numerical parameter tuning method based on numerical empirical data. However, in many cases no numerical empirical data are available, but properties for dynamic patterns are known that should be fulfilled, as requirements. Classical numerical parameter tuning methods normally cannot work with such dynamic properties, as they can only be true or false. To remedy this, in this paper the notion of approximate satisfaction of dynamic properties is introduced. It adds a numerical measure to the logical notion of satisfaction. By doing this, numerical optimization methods for parameter estimation become applicable to support the design of dynamic agent models for which dynamic properties have been specified as requirements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture

Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...

متن کامل

A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

متن کامل

A Markovian Model for Dynamic Constraint Processing

Dynamic constraint satisfaction is a useful tool for representing and solving sequential decision problems with complete knowledge in dynamic world. We propose an extension of the dynamic constraint satisfaction framework so as to represent stochastic events in sequential decision making. The basis of this extension consists in modeling evolution of the dynamic constraint satisfaction problem b...

متن کامل

Performance Evaluation of Dynamic Modulus Predictive Models for Asphalt Mixtures

Dynamic modulus characterizes the viscoelastic behavior of asphalt materials and is the most important input parameter for design and rehabilitation of flexible pavements using Mechanistic–Empirical Pavement Design Guide (MEPDG). Laboratory determination of dynamic modulus is very expensive and time consuming. To overcome this challenge, several predictive models were developed to determine dyn...

متن کامل

Dynamic Frailty and Change Point Models for Recurrent Events Data

Abstract. We present a Bayesian analysis for recurrent events data using a nonhomogeneous mixed Poisson point process with a dynamic subject-specific frailty function and a dynamic baseline intensity func- tion. The dynamic subject-specific frailty employs a dynamic piecewise constant function with a known pre-specified grid and the baseline in- tensity uses an unknown grid for the piecewise ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016